Model Checking for Modal Dependence Logic: An Approach through Post's Lattice
نویسندگان
چکیده
In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko Väänänen by extending modal logic by a the dependence atom dep(·). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using a Lattice approach introduced by Emil Post. This classification is done for all fragments of the logical language allowing modalities ♦ and , the dependence atom, and logical symbols for arbitrary Boolean functions.
منابع مشابه
Complexity of Model Checking for Modal Dependence Logic
Modal dependence logic (MDL) was introduced recently by Väänänen. It enhances the basic modal language by an operator =(·). For propositional variables p1, . . . , pn the atomic formula =(p1, . . . , pn−1, pn) intuitively states that the value of pn is determined solely by those of p1, . . . , pn−1. We show that model checking for MDL formulae over Kripke structures is NPcomplete and further co...
متن کاملExtended Modal Dependence Logic EMDL
In this paper we extend modal dependence logic MDL by allowing dependence atoms of the form dep(φ1, . . . , φn) where φi, 1 ≤ i ≤ n, are modal formulas (in MDL, only propositional variables are allowed in dependence atoms). The reasoning behind this extension is that it introduces a temporal component into modal dependence logic. E.g., it allows us to express that truth of propositions in some ...
متن کاملOn Extensions and Variants of Dependence Logic — A study of intuitionistic connectives in the team semantics setting
Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We obtain, among others, the following result...
متن کاملModel Checking with Multi-valued Logics
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multi-valued model checking. We first show how to reduce multi-valued model checking with any distributive DeMorgan lattice to standard, two-valued model checking. We then present a direct, automata-theoretic a...
متن کاملFaster SPDL Model Checking Through Property-Driven State Space Generation
In this paper we describe how both, memory and time requirements for stochastic model checking of SPDL (stochastic propositional dynamic logic) formulae can significantly be reduced. SPDL is the stochastic extension of the multi-modal program logic PDL. SPDL provides means to specify path-based properties with or without timing restrictions. Paths can be characterised by so-called programs, ess...
متن کامل